Further results concerning the simple queueing loss system

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further results concerning the simple queueing loss system

SCHMIDT proves that in the simple queueing loss system GI/G/1/0 the output or departure process is a renewal process if and only if GI = M, that is the arrival process is Poisson. In order to obtain this result, however, it must be assumed that the probability density functions of the arrival and service processes are both continuous and strictly positive on [0, ~ ] . These restrictions elimina...

متن کامل

Computer Networks A simple queueing system

The letter M stands for memoryless, i.e. the Poisson process with exponential distribution. Other possibilities include D for deterministic inter-arrival times, and G denoting a general distribution of inter-arrival times. Therefore, the M/M/1 queueing system consists of customers arriving according to a Poisson process with rate λ, and one server with a service time per customer that is expone...

متن کامل

Further Results on Betweenness Centrality of Graphs

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

متن کامل

Concerning Simple Continuous Curves

Various definitions of simple continuous arcs and closed curves have been given, f The definitions of arcs usually contain the requirement that the point-set in question should be bounded. In attempting to prove that every interval t of an open curve as defined in a recent paper \ is a simple continuous arc, while I found it easy to prove that t satisfies all the other requirements of Janiszews...

متن کامل

Generalized Loss Models and Queueing-Loss Networks

The classical Erlang and Engset loss models have been used extensively in the traffic engineering of traditional telephone exchanges. More recently, these models have been generalized to the so-called loss networks, which provide models for resource sharing in multiservice telecommunication networks. In this paper, we introduce a new generalized class of models, queueing-loss networks, which ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Unternehmensforschung Operations Research - Recherche Opérationnelle

سال: 1971

ISSN: 0340-9422,1432-5217

DOI: 10.1007/bf01939811